A characteristic set method for ordinary difference polynomial systems
نویسندگان
چکیده
We prove several basic properties for difference ascending chains including a necessary and sufficient condition for an ascending chain to be the characteristic set of its saturation ideal and a necessary and sufficient condition for an ascending chain to be the characteristic set of a reflexive prime ideal. Based on these properties, we propose an algorithm to decompose the zero set of a finite set of difference polynomials into the union of zero sets of certain ascending chains. This decomposition algorithm is implemented and used to solve the perfect ideal membership problem and to prove certain difference identities automatically.
منابع مشابه
On Partial Difference Coherent and Regular Ascending Chains
In this paper, we propose a characteristic set theory for partial difference polynomial systems. First, we introduce the concept of coherent ascending chains and prove that the difference polynomials in the saturation ideal of a coherent ascending chain has a canonical representation. Second, we introduce the concept of regular chains and prove that a partial difference ascending chain is the c...
متن کاملProperties of Ascending Chains for Partial Difference Polynomial Systems
A characteristic set theory for partial difference polynomial systems is proposed. We introduce the concept of coherent and regular ascending chains and prove that a partial difference ascending chain is the characteristic set of its saturation ideal if and only if it is coherent and regular. This gives a method to decide whether a polynomial belongs to the saturation ideal of an ascending chai...
متن کاملCharacteristic set method for differential-difference polynomial systems
In this paper, we present a characteristic set method for mixed differential and difference polynomial systems. We introduce the concepts of coherent, regular, proper irreducible, and strongly irreducible ascending chains and study their properties. We give an algorithm which can be used to decompose the zero set for a finitely generated differential and difference polynomial sets into the unio...
متن کاملPolynomial and Rational Solutions of Holonomic Systems
Polynomial and rational solutions for linear ordinary differential equations can be obtained by algorithmic methods. For instance, the maple package DEtools provides efficient functions polysols and ratsols to find polynomial and rational solutions for a given linear ordinary differential equation with rational function coefficients. A natural analogue of the notion of linear ordinary different...
متن کاملMonodromy problem for the degenerate critical points
For the polynomial planar vector fields with a hyperbolic or nilpotent critical point at the origin, the monodromy problem has been solved, but for the strongly degenerate critical points this problem is still open. When the critical point is monodromic, the stability problem or the center- focus problem is an open problem too. In this paper we will consider the polynomial planar vector fields ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Comput.
دوره 44 شماره
صفحات -
تاریخ انتشار 2009